Single-Seed Cascades on Clustered Networks

نویسنده

  • John K. McSweeney
چکیده

We consider a dynamic network cascade process developed by Watts [20] applied to a random networks with a specified amount of clustering, belonging to a class of random networks developed by Newman [19]. We adapt tree-based methods from [20] to formulate an appropriate two-type branching process to describe the spread of a cascade started with a single active node, and obtain a fixed-point equation to implicitly express the extinction probability of such a cascade. In so doing, we also recover a special case of a formula of Hackett et al. [12] giving conditions for certain extinction of the cascade.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic theory of cascades on finite clustered random networks with a threshold rule.

Cascade dynamics on networks are usually analyzed statically to determine existence criteria for cascades. Here, the Watts model of threshold dynamics on random Erdos-Rényi networks is analyzed to determine the dynamic time evolution of cascades. The network is assumed to have a specific finite number of nodes n and is not assumed to be treelike. All combinations of threshold ϕ, network average...

متن کامل

A New Model of Cascades on Random Networks with a Threshold Rule

Cascades on random networks are typically analyzed by assuming they map onto percolation processes and then are solved using generating function formulations. This approach assumes that the network is infinite and weakly connected, yet furthermore approximates a dynamic cascading process as a static percolation event. In this paper we propose a dynamic Markov model formulation that assumes a fi...

متن کامل

Don't Be Greedy: Leveraging Community Structure to Find High Quality Seed Sets for Influence Maximization

We consider the problem of maximizing the spread of influence in a social network by choosing a fixed number of initial seeds — a central problem in the study of network cascades. The majority of existing work on this problem, formally referred to as the influence maximization problem, is designed for submodular cascades. Despite the empirical evidence that many cascades are non-submodular, lit...

متن کامل

Sequential Seeding in Complex Networks: Trading Speed for Coverage

Information spreading in complex networks is often modeled as disseminating information with certain probability from nodes that possess it to their neighbors that do not. Information cascades are triggered when the activation of a set of initial nodes – seeds – results in diffusion to large number of nodes. Here, several novel approaches replacing the commonly used strategy of initiating all s...

متن کامل

Seed size strongly affects cascades on random networks.

The average avalanche size in the Watts model of threshold dynamics on random networks of arbitrary degree distribution is determined analytically. Existence criteria for global cascades are shown to depend sensitively on the size of the initial seed disturbance. The dependence of cascade size upon the mean degree z of the network is known to exhibit several transitions-these are typically cont...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1510.00056  شماره 

صفحات  -

تاریخ انتشار 2015